Parallel Radiosity Using a Shared Virtual Memory
نویسندگان
چکیده
The radiosity method is a very demanding process in terms of computing and memory resources. To cope with these problems, parallel solutions have been proposed in the literature. These solutions are outlined and classiied in this paper. A new parallel solution, based on the use of a shared virtual memory (SVM), is proposed. It will be shown that this concept of SVM greatly simpliies the implementation of a parallel algorithm. This new parallel radiosity algorithm has been implemented on an iPSC/2 hypercube using KOAN SVM. The rst results obtained with this algorithm are encouraging since the calculated eeciency curve is nearly linear.
منابع مشابه
Visibility Masks for Solving Complex Radiosity Computations on Multiprocessors
In this paper, we present a modi ed version of the virtual wall concept we introduced in a previously published paper. The goal of our work is to design a strategy to handle very complex scenes (more than 1 million of patches) for radiosity computation. Comparing to other radiosity algorithms, our solution focuses on the ability to compute the radiosity on local environments instead of solving ...
متن کاملParallel Hierarchical Radiosity On Cache-Coherent Multiprocessors
Computing radiosity is a computationally very expensive problem in computer graphics. Recent hierarchical methods have greatly speeded up the computation of first diffuse and now also specular radiosity. We present a parallel algorithm for computing both diffuse and specular radiosity together, and examine its performance in detail on cache-coherent shared address space multiprocessors. We comp...
متن کاملParallel Vertex-To-Vertex Radiosity on a Distributed Shared Memory System
18 2. For each of the rst several highest-energy vertices spawn a new job running the Parallel Step. Figure 8 shows that the event triggered scheduling policy performs better than the eager scheduling even when using the optimal value for the naive scheduler.
متن کاملScalability and Granularity Issues of the Hierarchical Radiosity Method
The radiosity method is a global illumination method from computer graphics to visualize light in scenes of diiuse objects within an enclosure. The hierarchical radiosity method reduces the problem size considerably but results in a highly irregular algorithm which makes a parallel implementation more diicult. We investigate a task-oriented shared memory implementation and present optimizations...
متن کاملHighly Pipelined Parallel Architecture
Despite the fact that realistic images can be generated by ray-tracing and radiosity shading, these techniques are impractical for scenes of high complexity because of the extremely high time cost. Several attempts have been made to reduce image synthesis time by using parallel architectures, but they still suffer from communication problems. In this paper, we present a new space partitioning w...
متن کامل